ChronoR: Rotation Based Temporal Knowledge Graph Embedding
نویسندگان
چکیده
Despite the importance and abundance of temporal knowledge graphs, most current research has been focused on reasoning static graphs. In this paper, we study challenging problem inference over particular, task link prediction. general, is a difficult due to data non-stationarity, heterogeneity, its complex dependencies. We propose Chronological Rotation embedding (ChronoR), novel model for learning representations entities, relations, time. Learning dense frequently used as an efficient versatile method perform The proposed learns k-dimensional rotation transformation parametrized by relation time, such that after each fact's head entity transformed using rotation, it falls near corresponding tail entity. By high dimensional operator, ChronoR captures rich interaction between multi-relational characteristics Temporal Knowledge Graph. Experimentally, show able outperform many state-of-the-art methods benchmark datasets graph
منابع مشابه
Semantically Smooth Knowledge Graph Embedding
This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...
متن کاملContext-Dependent Knowledge Graph Embedding
We consider the problem of embedding knowledge graphs (KGs) into continuous vector spaces. Existing methods can only deal with explicit relationships within each triple, i.e., local connectivity patterns, but cannot handle implicit relationships across different triples, i.e., contextual connectivity patterns. This paper proposes context-dependent KG embedding, a twostage scheme that takes into...
متن کاملGAKE: Graph Aware Knowledge Embedding
Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable research efforts recently. Most existing approaches treat the given knowledge base as a set of triplets, each of whose representation is then learned separately. However, as a fact, triples are connected and depend on each other. In this paper, we propose a graph aware know...
متن کاملTransition-based Knowledge Graph Embedding with Relational Mapping Properties
Many knowledge repositories nowadays contain billions of triplets, i.e. (head-entity, relationship, tail-entity), as relation instances. These triplets form a directed graph with entities as nodes and relationships as edges. However, this kind of symbolic and discrete storage structure makes it difficult for us to exploit the knowledge to enhance other intelligenceacquired applications (e.g. th...
متن کاملKnowledge Graph Embedding by Translating on Hyperplanes
We deal with embedding a large scale knowledge graph composed of entities and relations into a continuous vector space. TransE is a promising method proposed recently, which is very efficient while achieving state-of-the-art predictive performance. We discuss some mapping properties of relations which should be considered in embedding, such as reflexive, one-to-many, many-to-one, and many-to-ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i7.16802